On Transforming to Eliminate Clusters

Extending Higher-Order Deforestation: Transforming Programs to Eliminate Even More Trees

In previous work, we have shown howWadler’s original deforestation algorithm can be extended to handle higher-order programs. A higher-order treeless form of expression was defined to ensure the termination of this algorithm. Our higher-order algorithm was further extended by Seidl and Sørensen, and this extension was shown to remove some intermediate structures not removed by our algorithm (al...

High-Grade Urothelial Carcinoma of Bladder Transforming to Micropapillary Variant on Follow-Up

Micropapillary variant of urothelial carcinoma (UC) of the bladder is an aggressive tumour, comprising 0.6-6% of all UC. It generally presents with high-grade and stage, and has been reported as having a worse prognosis when compared to traditional UC. We report the case of a 58-year-old man who presented with macroscopic haematuria. The patient was diagnosed with high-grade urothelial carcinom...

How to Eliminate Destructive Testing

Implementing a Smart Method to Eliminate Artifacts of Vital Signals

Background: Electroencephalography (EEG) has vital and significant applications in different medical fields and is used for the primary evaluation of neurological disorders. Hence, having easy access to suitable and useful signal is very important. Artifacts are undesirable confusions which are generally originated from inevitable human activities such as heartbeat, blinking of eyes and facial ...

How to Eliminate a Graph

Vertex elimination is a graph operation that turns the neighborhood of a vertex into a clique and removes the vertex itself. It has widely known applications within sparse matrix computations. We define the Elimination problem as follows: given two graphs G and H, decide whether H can be obtained from G by |V (G)| − |V (H)| vertex eliminations. We study the parameterized complexity of the Elimi...